On the Efficient Parallel Computation of Legendre Transforms
نویسندگان
چکیده
منابع مشابه
On the Efficient Parallel Computation of Legendre Transforms
In this article, we discuss a parallel implementation of efficient algorithms for computation of Legendre polynomial transforms and other orthogonal polynomial transforms. We develop an approach to the Driscoll–Healy algorithm using polynomial arithmetic and present experimental results on the accuracy, efficiency, and scalability of our implementation. The algorithms were implemented in ANSI C...
متن کاملThe efficient computation of Fourier transforms on the symmetric group
This paper introduces new techniques for the efficient computation of Fourier transforms on symmetric groups and their homogeneous spaces. We replace the matrix multiplications in Clausen’s algorithm with sums indexed by combinatorial objects that generalize Young tableaux, and write the result in a form similar to Horner’s rule. The algorithm we obtain computes the Fourier transform of a funct...
متن کاملInverse Transforms of Products of Legendre Transforms
is obtained by applying successive integration by parts to the integral represented by the left-hand member of this equation so that the new integrand is the product of F by [(1 —x2)P„' ]', and by replacing this second factor by — n(n + l)Pn according to Legendre's differential equation [l]. Thus certain boundary value problems in ordinary and partial differential equations that involve the dif...
متن کاملHierarchical Load Balancing for Parallel Fast Legendre Transforms
We present a parallel Fast Legendre Transform (FLT) based on the Driscol{Healy algorithm with computation complexity O(N log 2 N). The parallel FLT is load{ balanced in a hierarchical fashion. We use a load{balanced FFT to deduce a load{ balanced parallel fast cosine transform, which in turn serves as a building block for the Legendre transform engine, from which the parallel FLT is constructed...
متن کاملEfficient computation of densely sampled wavelet transforms
An efficient algorithm is presented for computing the continuous wavelet transform and the wideband ambiguity function on a sample grid with uniform time spacing but arbitrary sampling in scale. The method is based on the chirp z-transform and requires the same order of computation as constant-bandwidth analysis techniques, such as the short-time Fourier transform and the narrowband ambiguity f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2001
ISSN: 1064-8275,1095-7197
DOI: 10.1137/s1064827599355864